Quasi-semidefinite eigenvalue problem and applications
نویسندگان
چکیده
منابع مشابه
Semidefinite programming and eigenvalue bounds for the graph partition problem
The graph partition problem is the problem of partitioning the vertex set of a graph into a fixed number of sets of given sizes such that the total weight of edges joining different sets is optimized. In this paper we simplify a known matrix-lifting semidefinite programming relaxation of the graph partition problem for several classes of graphs and also show how to aggregate additional triangle...
متن کاملEigenvalue Bounds Versus Semidefinite Relaxations for the Quadratic Assignment Problem
It was recently demonstrated that a well-known eigenvalue bound for the Quadratic Assignment Problem (QAP) actually corresponds to a semideenite programming (SDP) relaxation. However, for this bound to be computationally useful the assignment constraints of the QAP must rst be eliminated, and the bound then applied to a lower-dimensional problem. The resulting \projected eigenvalue bound" is on...
متن کاملTheN-Eigenvalue Problem and Two Applications
Consider the following two questions. (1) When does a compact Lie group G ⊂ U(n) have an element g ∈ G possessing exactly two eigenvalues? (2) When does a compact Lie group G ⊂ U(n) have a cocharacter U(1) → G such that the compositionU(1) → U(n) is a representation ofU(1)with exactly two weights? A solution to the second problem gives a family of solutions to the first, by choosing g to be alm...
متن کاملA generalized eigenvalue problem for quasi-orthogonal rational functions
In general, the zeros of an orthogonal rational function (ORF) on a subset of the real line, with poles among {α1, . . . , αn} ⊂ (C0 ∪ {∞}), are not all real (unless αn is real), and hence, they are not suitable to construct a rational Gaussian quadrature rule (RGQ). For this reason, the zeros of a so-called quasi-ORF or a so-called paraORF are used instead. These zeros depend on one single par...
متن کاملThe inverse eigenvalue problem for symmetric quasi anti-bidiagonal matrices
In this paper we construct the symmetric quasi anti-bidiagonal matrix that its eigenvalues are given, and show that the problem is also equivalent to the inverse eigenvalue problem for a certain symmetric tridiagonal matrix which has the same eigenvalues. Not only elements of the tridiagonal matrix come from quasi anti-bidiagonal matrix, but also the places of elements exchange based on some co...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Nanosystems: Physics, Chemistry, Mathematics
سال: 2017
ISSN: 2220-8054
DOI: 10.17586/2220-8054-2017-8-2-180-187